On the combinatorics of plethysm

نویسنده

  • Oscar A. Z. Nava
چکیده

We construct three (large, reduced) incidence algebras whose semigroups of multiplicative functions, under convolution, are anti-isomorphic, respectively, to the semigroups of what we call partitional, permutational and exponential formal power series without constant term, in infinitely many variables x = (x,, x2,...), under plethysm. We compute the Mobius function in each case. These three incidence algebras are the linear duals of incidence bialgebras arising, respectively, from the classes of transversals of partitions (with an order that we define), partitions compatible with permutations (with the usual refinement order), and linear transversals of linear partitions (with the order induced by that on transversals). We define notions of morphisms between partitions, permutations and linear partitions, respectively, whose kernels are defined to be, in each case, transversals, compatible partitions and linear transversals. We introduce, in each case, a pair of sequences of polynomials in x of binomial type, counting morphisms and monomorphisms, and obtain expressions for their connection constants, by summation and Mobius inversion over the corresponding posets of kernels.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Plethysm, Partitions with an Even Number of Blocks and Euler Numbers

This paper is based on an hour address given at the Sixth Conference on Formal Power Series and Algebraic Combinatorics, held at DIMACS in 1994. It is written primarily for an audience of combinatorialists. Our hope is to publicise some intriguing enumerative conjectures which arise in the study of the homology representations of the poset of (set) partitions with an even number of blocks. The ...

متن کامل

Partitions of Even Rank and Euler Numbers

This paper is based on an hour address given at the Sixth Conference on Formal Power Series and Algebraic Combinatorics, held at DIMACS in 1994. It is written primarily for an audience of combinato-rialists. Our hope is to publicise some intriguing enumerative conjectures which arise in the study of the homology representations of the poset of (set) partitions with an even number of blocks. The...

متن کامل

On Plethysm Conjectures of Stanley and Foulkes: The 2 × n Case

We prove Stanley’s plethysm conjecture for the 2×n case, which composed with the work of Black and List provides another proof of Foulkes conjecture for the 2× n case. We also show that the way Stanley formulated his conjecture, it is false in general, and suggest an alternative formulation.

متن کامل

Plethysm of Schur Functions and Irreducible Polynomial Representations of the Complex General Linear Group

We show the intimate connection Schur functions have with the irreducible polynomial representations of GL(n,C). Following Schur’s thesis, in Section 1, we prove that the characters of these representations are given by Schur functions. In the second section, we elaborate on how a specific combinatorial operation on symmetric functions called plethysm gives the characters of the composition of ...

متن کامل

A Plethysm Formula on the Characteristic Map of Induced Linear Characters from Un(𝔽q) to GL(𝔽q)

This paper gives a plethysm formula on the characteristic map of the induced linear characters from the unipotent upper-triangular matrices Un(Fq) to GLn(Fq), the general linear group over finite field Fq. The result turns out to be a multiple of a twisted version of the Hall-Littlewood symmetric functions P̃n[Y ; q]. A recurrence relation is also given which makes it easy to carry out the compu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 46  شماره 

صفحات  -

تاریخ انتشار 1987